Tree-like Decompositions and Conformal Maps
نویسندگان
چکیده
Any simply connected rectifiable domain Ω can be decomposed into uniformly chord-arc subdomains using only crosscuts of the domain. We show that such a decomposition allows one to construct a map from Ω to the disk which is close to conformal in a uniformly quasiconformal sense. This answers a question of Stephen Vavasis. 1991 Mathematics Subject Classification. Primary: 30C35 Secondary: 30C30, 65E05, 30C62 .
منابع مشابه
Stability of F-biharmonic maps
This paper studies some properties of F-biharmonic maps between Riemannian manifolds. By considering the first variation formula of the F-bienergy functional, F-biharmonicity of conformal maps are investigated. Moreover, the second variation formula for F-biharmonic maps is obtained. As an application, instability and nonexistence theorems for F-biharmonic maps are given.
متن کاملBubble Tree Convergence for Harmonic Maps
Let Σ be a compact Riemann surface. Any sequence fn : Σ —> M of harmonic maps with bounded energy has a "bubble tree limit" consisting of a harmonic map /o : Σ -> M and a tree of bubbles fk : S 2 -> M. We give a precise construction of this bubble tree and show that the limit preserves energy and homotopy class, and that the images of the fn converge pointwise. We then give explicit counterexam...
متن کاملGraph Automata and Their Application to the Verification of Dynamic Systems
The aim of this thesis is to provide verification techniques based on formal language theory and graph theory for graph transformation systems. Graph transformation systems can be used in a large number of application areas. In many cases it is very natural to model concurrent and distributed systems or other systems, where evolving graph-like structures play a role, by means of graph transform...
متن کاملTree Decompositions of Graphs: Saving Memory in Dynamic Programming
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced “anchor technique” is closely related to a tree-like set covering problem.
متن کاملSharp Stability Results for Almost Conformal Maps in Even Dimensions
Let ~ C R n and n > 4 be even. We show that if a sequence {uJ } in W l'n/2 (f2; R n) is almost conformal in the sense that dist (Vu j , R+ SO(n) ) converges strongly to 0 in L n/2 and i f u j converges weakly to u in W 1,n/2, then u is conformal and VuJ ~ Vu strongly in Lqoc for all 1 < q < n/2. It is known that this conclusion fails i f n~2 is replaced by any smaller exponent p. We also prove ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009